A Note on the Semi-Infinite Programming Approach to Complex Approximation
نویسندگان
چکیده
منابع مشابه
A Note on the Semi-Infinite Programming Approach to Complex Approximation
Several observations are made about a recently proposed semi-infinite programming (SIP) method for computation of linear Chebyshev approximations to complex-valued functions. A particular discretization of the SIP problem is shown to be equivalent to replacing the usual absolute value of a complex number with related estimates, resulting in a class of quasi-norms on the complex number field C, ...
متن کاملA numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
متن کاملAn Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems is proposed. Both primal and dual convergence results are established under some basic assumptions. Numerical examples are also included to illustrate this approach.
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملDiscretization in Semi-Infinite Programming: The rate of approximation
The discretization approach for solving semi-infinite optimization problems is considered. We are interested in the rate of the approximation error between the solution of the semi-infinite problem and the solution of the discretized program depending on the discretization mesh-size d. It will be shown how this rate depends on whether the minimizer is strict of order one or two and on whether t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1983
ISSN: 0025-5718
DOI: 10.2307/2007536